On the Cholesky Factorization of the Gram Matrix of Multivariate Functions
نویسندگان
چکیده
We study the Cholesky factorization of certain biinnnite matrices and related nite matrices. These results are applied to show that if the uniform translates of a suitably decaying multivariate function are orthonormali-zed by the Gram-Schmidt process over certain increasing nite sets, then the resulting functions converge to translates of a xed function which is obtained by a global orthonormalization procedure. This convergence is also illustrated numerically. 1. Introduction Motivated by the use of orthogonal spline functions in various applications, e.g. 7] and 6], the authors showed in 3] that when uniform translates of a compactly supported function are orthonormalized by the Gram-Schmidt process over increasing nite intervals, then the resulting functions converge exponentially to translates of a xed function which is obtained by an orthonormalization procedure over the whole line. This global orthonormalization is derived from the Cholesky factorization of the biinnnite Gram matrix of the translates of the original function , while the Gram-Schmidt process is derived from the Cholesky factorization of nite Gram matrices which approximate sections of the biinnnite matrix. The convergence result is then derived from a more general result about convergence of Cholesky factors of positive deenite matrices whose elements decay exponentially away from the diagonal. In 5] these results were extended to the case where the original function need not have compact support but decays exponentially. In this paper we shall extend the above results in two directions: to functions in more than one dimension which may decay at a slower rate than exponential. The extensions both in dimension and in decay rate require signiicant changes in technique and lead to a much richer theory. In Section 2 we consider the Cholesky factorization of the biinnnite Gram matrix which, since the matrix is Toeplitz, is equivalent to the spectral factorization of its symbol. This factorization is gained by writing the logarithm of the symbol as an appropriate sum of two terms and then taking the exponential, a procedure justiied by applying a technique of Newman 8]. In electrical engineering this is called the cepstral method 1, 9]. In
منابع مشابه
New Bases for Polynomial-Based Spaces
Since it is well-known that the Vandermonde matrix is ill-conditioned, while the interpolation itself is not unstable in function space, this paper surveys the choices of other new bases. These bases are data-dependent and are categorized into discretely l2-orthonormal and continuously L2-orthonormal bases. The first one construct a unitary Gramian matrix in the space l2(X) while the late...
متن کاملCIMGS: An Incomplete Orthogonal FactorizationPreconditioner
A new preconditioner for symmetric positive definite systems is proposed, analyzed, and tested. The preconditioner, compressed incomplete modified Gram–Schmidt (CIMGS), is based on an incomplete orthogonal factorization. CIMGS is robust both theoretically and empirically, existing (in exact arithmetic) for any full rank matrix. Numerically it is more robust than an incomplete Cholesky factoriza...
متن کاملCholesky-Like Factorization of Symmetric Indefinite Matrices and Orthogonalization with Respect to Bilinear Forms
It is well-known that orthogonalization of column vectors in a rectangular matrix B with respect to the bilinear form induced by a nonsingular symmetric indefinite matrix A can be seen as its factorization B = QR that is equivalent to the Cholesky-like factorization in the form BTAB = RTΩR, where Ω is some signature matrix. Under the assumption of nonzero principal minors of the matrix M = BTAB...
متن کاملA Modified Digital Image Watermarking Scheme Based on Nonnegative Matrix Factorization
This paper presents a modified digital image watermarking method based on nonnegative matrix factorization. Firstly, host image is factorized to the product of three nonnegative matrices. Then, the centric matrix is transferred to discrete cosine transform domain. Watermark is embedded in low frequency band of this matrix and next, the reverse of the transform is computed. Finally, watermarked ...
متن کاملCOVARIANCE MATRIX OF MULTIVARIATE REWARD PROCESSES WITH NONLINEAR REWARD FUNCTIONS
Multivariate reward processes with reward functions of constant rates, defined on a semi-Markov process, first were studied by Masuda and Sumita, 1991. Reward processes with nonlinear reward functions were introduced in Soltani, 1996. In this work we study a multivariate process , , where are reward processes with nonlinear reward functions respectively. The Laplace transform of the covar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Matrix Analysis Applications
دوره 22 شماره
صفحات -
تاریخ انتشار 2000